Ready, Set, Go! The Voronoi diagram of moving points that start from a line
نویسنده
چکیده
It is an outstanding open problem of computational geometry to prove a nearquadratic upper bound on the number of combinatorial changes in the Voronoi diagram of points moving at a common constant speed along linear trajectories in the plane. In this note we observe that this quantity is Θ(n) if the points start their movement from a common line.
منابع مشابه
Pursuit - Evasion Voronoi Diagrams in l
We are given m pursuers and one evader. Each pursuer and the evader has an associated starting point in the plane, a maximum speed, and a start time. We also have a set of line segment obstacles with a total of n endpoints. Our task is to find those points in the plane, called the evader’s region, that the evader can reach via evasive paths. A path is evasive if the evader can traverse the path...
متن کاملPursuit - Evasion Voronoi Diagrams in 1 ∗
We are given m pursuers and one evader. Each pursuer and the evader has an associated starting point in the plane, a maximum speed, and a start time. We also have a set of line segment obstacles with a total of n endpoints. Our task is to find those points in the plane, called the evader’s region, that the evader can reach via evasive paths. A path is evasive if the evader can traverse the path...
متن کاملA sweepline algorithm for Euclidean Voronoi diagram of circles
Presented in this paper is a sweepline algorithm to compute the Voronoi diagram of a set of circles in a two-dimensional Euclidean space. The radii of the circles are non-negative and not necessarily equal. It is allowed that circles intersect each other, and a circle contains others. The proposed algorithm constructs the correct Voronoi diagram as a sweepline moves on the plane from top to bot...
متن کاملVoronoi Diagrams of Moving Points
Consider a set of n points in d-dimensional Euclidean space, d 2, each of which is continuously moving along a given individual trajectory. At each instant in time, the points deene a Voronoi diagram. As the points move, the Voronoi diagram changes continuously, but at certain critical instants in time, topological events occur that cause a change in the Voronoi diagram. In this paper, we prese...
متن کاملCompact Voronoi Diagrams for Moving Convex Polygons
We describe a kinetic data structure for maintaining a compact Voronoi-like diagram of convex polygons moving around in the plane. We use a compact diagram for the polygons, dual to the Voronoi, first presented in [MKS96]. A key feature of this diagram is that its size is only a function of the number of polygons and not of their complexity. We demonstrate a local certifying property of that di...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 89 شماره
صفحات -
تاریخ انتشار 2004